An identity in combinatorial extremal theory
نویسندگان
چکیده
منابع مشابه
Irregularities of Distributions and Extremal Sets in Combinatorial Complexity Theory
In 2004 the second author of the present paper proved that a point set in [0, 1] which has star-discrepancy at most ε must necessarily consist of at least cabsdε −1 points. Equivalently, every set of n points in [0, 1] must have star-discrepancy at least cabsdn . The original proof of this result uses methods from Vapnik–Chervonenkis theory and from metric entropy theory. In the present paper w...
متن کاملA Combinatorial Identity Arising from Cobordism Theory
Let α = (α1, α2, · · · , αm) ∈ R>0. Let αi,j be the vector obtained from α by deleting the entries αi and αj . Besser and Moree [1] introduced some invariants and near invariants related to the solutions ∈ {±1}m−2 of the linear inequality |αi −αj | < 〈 , αi,j〉 < αi +αj , where 〈, 〉 denotes the usual inner product and αi,j the vector obtained from α by deleting αi and αj . The main result of Bes...
متن کاملOn Some Interconnections between Combinatorial Optimization and Extremal Graph Theory
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants u...
متن کاملAn Extremal Problem in Generalized Ramsey Theory
A connected graph G of order n is called m-good if r(Km ,G) = (m-1)(n-1) + 1 . Let f(m,n) be the largest integer q such that every connected graph of order n and size q is m-good and let g(m,n) be the largest q for which there exists a connected graph G of order n and size q which is m-good . Asymptotic bounds are given for f and g . 1 . Tntroduction . One of the most notable yet simply proved ...
متن کاملAn Extremal Problem in Interpolation Theory
If z1, z2, . . . , zn are complex numbers in the open unit disk D and A1, A2, . . . , An are N ×N matrices, let F denote the family of analytic functions, bounded in D, such that for each F ∈ F , F (zk) = Ak, k = 1, 2, . . . , n. We consider ρ = infF∈F supz∈D |F (z)|sp where | · |sp denotes the spectral radius. H. Bercovici has raised the question whether this infimum is attained. We will show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1990
ISSN: 0001-8708
DOI: 10.1016/0001-8708(90)90023-g